TSTP Solution File: DAT335^2 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : DAT335^2 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 22:11:13 EDT 2023
% Result : CounterSatisfiable 35.69s 35.91s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT335^2 : TPTP v8.1.2. Released v8.1.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 14:29:02 EDT 2023
% 0.19/0.35 % CPUTime :
% 0.20/0.48 %----Proving TH0
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 % File : DAT335^2 : TPTP v8.1.2. Released v8.1.0.
% 0.20/0.49 % Domain : Data Structures
% 0.20/0.49 % Problem : Database querying
% 0.20/0.49 % Version : [BP13] axioms.
% 0.20/0.49 % English :
% 0.20/0.49
% 0.20/0.49 % Refs : [Rei92] Reiter (1992), What Should a Database Know?
% 0.20/0.49 % : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.20/0.49 % : [BP13] Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.20/0.49 % : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.20/0.49 % Source : [TPTP]
% 0.20/0.49 % Names : APM010+1 [QMLTP]
% 0.20/0.49
% 0.20/0.49 % Status : CounterCounterSatisfiable
% 0.20/0.49 % Rating : 0.25 v8.1.0
% 0.20/0.49 % Syntax : Number of formulae : 33 ( 11 unt; 20 typ; 10 def)
% 0.20/0.49 % Number of atoms : 40 ( 10 equ; 0 cnn)
% 0.20/0.49 % Maximal formula atoms : 10 ( 3 avg)
% 0.20/0.49 % Number of connectives : 56 ( 1 ~; 1 |; 2 &; 49 @)
% 0.20/0.49 % ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% 0.20/0.49 % Maximal formula depth : 10 ( 3 avg)
% 0.20/0.49 % Number of types : 3 ( 1 usr)
% 0.20/0.49 % Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% 0.20/0.49 % Number of symbols : 20 ( 19 usr; 7 con; 0-3 aty)
% 0.20/0.49 % Number of variables : 30 ( 25 ^; 3 !; 2 ?; 30 :)
% 0.20/0.49 % SPC : TH0_CSA_EQU_NAR
% 0.20/0.49
% 0.20/0.49 % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.20/0.49 % version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.20/0.49 % 'modal' embedding, version 1.5.2. Logic specification used:
% 0.20/0.49 % $modal == [$constants == $rigid,$quantification == $constant,
% 0.20/0.49 % $modalities == $modal_system_T].
% 0.20/0.49 %------------------------------------------------------------------------------
% 0.20/0.49 thf(mworld,type,
% 0.20/0.49 mworld: $tType ).
% 0.20/0.49
% 0.20/0.49 thf(mrel_type,type,
% 0.20/0.49 mrel: mworld > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mactual_type,type,
% 0.20/0.49 mactual: mworld ).
% 0.20/0.49
% 0.20/0.49 thf(mlocal_type,type,
% 0.20/0.49 mlocal: ( mworld > $o ) > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mlocal_def,definition,
% 0.20/0.49 ( mlocal
% 0.20/0.49 = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mnot_type,type,
% 0.20/0.49 mnot: ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mand_type,type,
% 0.20/0.49 mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mor_type,type,
% 0.20/0.49 mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mimplies_type,type,
% 0.20/0.49 mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mequiv_type,type,
% 0.20/0.49 mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mnot_def,definition,
% 0.20/0.49 ( mnot
% 0.20/0.49 = ( ^ [A: mworld > $o,W: mworld] :
% 0.20/0.49 ~ ( A @ W ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mand_def,definition,
% 0.20/0.49 ( mand
% 0.20/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.49 ( ( A @ W )
% 0.20/0.49 & ( B @ W ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mor_def,definition,
% 0.20/0.49 ( mor
% 0.20/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.49 ( ( A @ W )
% 0.20/0.49 | ( B @ W ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mimplies_def,definition,
% 0.20/0.49 ( mimplies
% 0.20/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.49 ( ( A @ W )
% 0.20/0.49 => ( B @ W ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mequiv_def,definition,
% 0.20/0.49 ( mequiv
% 0.20/0.49 = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.20/0.49 ( ( A @ W )
% 0.20/0.49 <=> ( B @ W ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mbox_type,type,
% 0.20/0.49 mbox: ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mbox_def,definition,
% 0.20/0.49 ( mbox
% 0.20/0.49 = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.20/0.49 ! [V: mworld] :
% 0.20/0.49 ( ( mrel @ W @ V )
% 0.20/0.49 => ( Phi @ V ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mdia_type,type,
% 0.20/0.49 mdia: ( mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mdia_def,definition,
% 0.20/0.49 ( mdia
% 0.20/0.49 = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.20/0.49 ? [V: mworld] :
% 0.20/0.49 ( ( mrel @ W @ V )
% 0.20/0.49 & ( Phi @ V ) ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mrel_reflexive,axiom,
% 0.20/0.49 ! [W: mworld] : ( mrel @ W @ W ) ).
% 0.20/0.49
% 0.20/0.49 thf(mforall_di_type,type,
% 0.20/0.49 mforall_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mforall_di_def,definition,
% 0.20/0.49 ( mforall_di
% 0.20/0.49 = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.20/0.49 ! [X: $i] : ( A @ X @ W ) ) ) ).
% 0.20/0.49
% 0.20/0.49 thf(mexists_di_type,type,
% 0.20/0.49 mexists_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.20/0.49
% 0.20/0.49 thf(mexists_di_def,definition,
% 0.20/0.49 ( mexists_di
% 0.20/0.49 = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.20/0.49 ? [X: $i] : ( A @ X @ W ) ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(cs_decl,type,
% 0.20/0.50 cs: $i ).
% 0.20/0.50
% 0.20/0.50 thf(sue_decl,type,
% 0.20/0.50 sue: $i ).
% 0.20/0.50
% 0.20/0.50 thf(mary_decl,type,
% 0.20/0.50 mary: $i ).
% 0.20/0.50
% 0.20/0.50 thf(john_decl,type,
% 0.20/0.50 john: $i ).
% 0.20/0.50
% 0.20/0.50 thf(math_decl,type,
% 0.20/0.50 math: $i ).
% 0.20/0.50
% 0.20/0.50 thf(psych_decl,type,
% 0.20/0.50 psych: $i ).
% 0.20/0.50
% 0.20/0.50 thf(teach_decl,type,
% 0.20/0.50 teach: $i > $i > mworld > $o ).
% 0.20/0.50
% 0.20/0.50 thf(db,axiom,
% 0.20/0.50 ( mlocal
% 0.20/0.50 @ ( mbox
% 0.20/0.50 @ ( mand @ ( teach @ john @ math )
% 0.20/0.50 @ ( mand
% 0.20/0.50 @ ( mexists_di
% 0.20/0.50 @ ^ [X: $i] : ( teach @ X @ cs ) )
% 0.20/0.50 @ ( mand @ ( teach @ mary @ psych ) @ ( teach @ sue @ psych ) ) ) ) ) ) ).
% 0.20/0.50
% 0.20/0.50 thf(query,conjecture,
% 0.20/0.50 ( mlocal
% 0.20/0.50 @ ( mexists_di
% 0.20/0.50 @ ^ [X: $i] : ( mand @ ( teach @ X @ psych ) @ ( mnot @ ( mbox @ ( teach @ X @ cs ) ) ) ) ) ) ).
% 0.20/0.50
% 0.20/0.50 %------------------------------------------------------------------------------
% 0.20/0.50 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.gxkcFIV6qI/cvc5---1.0.5_26886.p...
% 0.20/0.50 (declare-sort $$unsorted 0)
% 0.20/0.50 (declare-sort tptp.mworld 0)
% 0.20/0.50 (declare-fun tptp.mrel (tptp.mworld tptp.mworld) Bool)
% 0.20/0.50 (declare-fun tptp.mactual () tptp.mworld)
% 0.20/0.50 (declare-fun tptp.mlocal ((-> tptp.mworld Bool)) Bool)
% 0.20/0.50 (assert (= tptp.mlocal (lambda ((Phi (-> tptp.mworld Bool))) (@ Phi tptp.mactual))))
% 0.20/0.50 (declare-fun tptp.mnot ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (declare-fun tptp.mand ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (declare-fun tptp.mor ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (declare-fun tptp.mimplies ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (declare-fun tptp.mequiv ((-> tptp.mworld Bool) (-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (assert (= tptp.mnot (lambda ((A (-> tptp.mworld Bool)) (W tptp.mworld)) (not (@ A W)))))
% 0.20/0.50 (assert (= tptp.mand (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (and (@ A W) (@ B W)))))
% 0.20/0.50 (assert (= tptp.mor (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (or (@ A W) (@ B W)))))
% 0.20/0.50 (assert (= tptp.mimplies (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (=> (@ A W) (@ B W)))))
% 0.20/0.50 (assert (= tptp.mequiv (lambda ((A (-> tptp.mworld Bool)) (B (-> tptp.mworld Bool)) (W tptp.mworld)) (= (@ A W) (@ B W)))))
% 0.20/0.50 (declare-fun tptp.mbox ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (assert (= tptp.mbox (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (forall ((V tptp.mworld)) (=> (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.20/0.50 (declare-fun tptp.mdia ((-> tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (assert (= tptp.mdia (lambda ((Phi (-> tptp.mworld Bool)) (W tptp.mworld)) (exists ((V tptp.mworld)) (and (@ (@ tptp.mrel W) V) (@ Phi V))))))
% 0.20/0.50 (assert (forall ((W tptp.mworld)) (@ (@ tptp.mrel W) W)))
% 0.20/0.50 (declare-fun tptp.mforall_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (assert (= tptp.mforall_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (forall ((X $$unsorted)) (@ (@ A X) W)))))
% 0.20/0.50 (declare-fun tptp.mexists_di ((-> $$unsorted tptp.mworld Bool) tptp.mworld) Bool)
% 0.20/0.50 (assert (= tptp.mexists_di (lambda ((A (-> $$unsorted tptp.mworld Bool)) (W tptp.mworld)) (exists ((X $$unsorted)) (@ (@ A X) W)))))
% 0.20/0.50 (declare-fun tptp.cs () $$unsorted)
% 0.20/0.50 (declare-fun tptp.sue () $$unsorted)
% 0.20/0.50 (declare-fun tptp.mary () $$unsorted)
% 0.20/0.50 (declare-fun tptp.john () $$unsorted)
% 0.20/0.50 (declare-fun tptp.math () $$unsorted)
% 0.20/0.50 (declare-fun tptp.psych () $$unsorted)
% 0.20/0.50 (declare-fun tptp.teach ($$unsorted $$unsorted tptp.mworld) Bool)
% 0.20/0.50 (assert (@ tptp.mlocal (@ tptp.mbox (@ (@ tptp.mand (@ (@ tptp.teach tptp.john) tptp.math)) (@ (@ tptp.mand (@ tptp.mexists_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (@ (@ (@ tptp.teach X) tptp.cs) __flatten_var_0)))) (@ (@ tptp.mand (@ (@ tptp.teach tptp.mary) tptp.psych)) (@ (@ tptp.teach tptp.sue) tptp.psych)))))))
% 0.20/0.50 (assert (not (@ tptp.mlocal (@ tptp.mexists_di (lambda ((X $$unsorted) (__flatten_var_0 tptp.mworld)) (let ((_let_1 (@ tptp.teach X))) (@ (@ (@ tptp.mand (@ _let_1 tptp.psych)) (@ tptp.mnot (@ tptp.mbox (@ _let_1 tptp.cs)))) __flatten_var_0)))))))
% 0.20/0.50 (set-info :filename cvc5---1.0.5_26886)
% 0.20/0.50 (check-sat-assuming ( true ))
% 0.20/0.50 ------- get file name : TPTP file name is DAT335^2
% 35.69/35.91 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_26886.smt2...
% 35.69/35.91 --- Run --ho-elim --full-saturate-quant at 10...
% 35.69/35.91 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 35.69/35.91 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 35.69/35.91 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 35.69/35.91 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 35.69/35.91 % SZS status CounterSatisfiable for DAT335^2
% 35.69/35.91 % cvc5---1.0.5 exiting
% 35.69/35.91 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------